منابع مشابه
Upward Spirality and Upward Planarity Testing
The upward planarity testing problem is known to be NPhard. We describe an O(n)-time upward planarity testing and embedding algorithm for the class of digraphs that do not contain rigid triconnected components. We also present a new FPT algorithm that solves the upward planarity testing and embedding problem for general digraphs.
متن کاملComputing Upward Topological Book Embeddings of Upward Planar Digraphs
This paper studies the problem of computing an upward topological book embedding of an upward planar digraph G, i.e. a topological book embedding of G where all edges are monotonically increasing in the upward direction. Besides having its own inherent interest in the theory of upward book embeddability, the question has applications to well studied research topics of computational geometry and...
متن کاملWorking-class participation, middle-class aspiration? Value, upward mobility and symbolic indebtedness in higher education
This paper interrogates the relationship between working-class participation in higher education (HE) in England and social and cultural mobility. It argues that embarking on a university education for working-class people has been construed in governmental discourses as an instrumental means of achieving upward mobility, or of aspiring to ‘become middle class’. Education in this sense is thus ...
متن کاملUpward Partitioned Book Embeddings
We analyze a directed variation of the book embedding problem when the page partition is prespecified and the nodes on the spine must be in topological order (upward book embedding). Given a directed acyclic graph and a partition of its edges into k pages, can we linearly order the vertices such that the drawing is upward (a topological sort) and each page avoids crossings? We prove that the pr...
متن کاملUpward Saturated Hyperclones
Hyperoperations are mappings that assign a non-void subset of a set to each n-tuple of elements from the set. They present a fundamental notion for modeling non deterministic processes. Even though for each non deterministic automaton there is a language equivalent deterministic automaton, they do not have the same behavior. As behavior of concurrent processes took place in emerging fields of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana Law Review
سال: 2018
ISSN: 2169-320X,0090-4198
DOI: 10.18060/4806.1193